recursion formula

См. также в других словарях:

• recursion formula — Math. a formula for determining the next term of a sequence from one or more of the preceding terms. Also called recurrence formula. [1925 30] * * * …   Universalium

• recursion formula — Math. a formula for determining the next term of a sequence from one or more of the preceding terms. Also called recurrence formula. [1925 30] …   Useful english dictionary

• recursion — n. 1 the act or an instance of returning. 2 Math. the repeated application of a procedure or definition to a previous result to obtain a series of values. Phrases and idioms: recursion formula Math. an expression giving successive terms of a… …   Useful english dictionary

• Recursión de Levinson — Saltar a navegación, búsqueda La recursión de Levinson o de Levinson Durbin es un algoritmo del álgebra lineal para calcular en forma recursiva la solución de una ecuación que involucra una matriz de Toeplitz. El costo computacional es de Θ(n2),… …   Wikipedia Español

• Recursion — Recursion, in mathematics and computer science, is a method of defining functions in which the function being defined is applied within its own definition. The term is also used more generally to describe a process of repeating objects in a self… …   Wikipedia

• Recursion theory — Recursion theory, also called computability theory, is a branch of mathematical logic that originated in the 1930s with the study of computable functions and Turing degrees. The field has grown to include the study of generalized computability… …   Wikipedia

• recursion — noun Etymology: Late Latin recursion , recursio, from recurrere Date: 1616 1. return 1 2. the determination of a succession of elements (as numbers or functions) by operation on one or more preceding elements according to a rule or formula… …   New Collegiate Dictionary

• recursion — /rəˈkɜʒən/ (say ruh kerzhuhn) noun the operation of a rule or formula to determine a succession of terms, the rule being derived by analysis of the preceding terms. {Latin recursiōn , stem of recursiō} …  

• recursion — [rɪ kə:ʃ(ə)n] noun chiefly Mathematics & Linguistics the repeated application of a procedure or rule to successive results of the process. ↘a recursive procedure or formula …   English new terms dictionary

• Weyl character formula — In mathematics, the Weyl character formula in representation theory describes the characters of irreducible representations of compact Lie groups in terms of their highest weights. It is named after Hermann Weyl, who proved it in the late… …   Wikipedia

• Levinson recursion — or Levinson Durbin recursion is a procedure in linear algebra to recursively calculate the solution to an equation involving a Toeplitz matrix. The algorithm runs in Θ(n2) time, which is a strong improvement over Gauss Jordan elimination, which… …   Wikipedia